The half dimensional sieve

The Neumann Sieve Problem and Dimensional Reduction: a Multiscale Approach

We perform a multiscale analysis for the elastic energy of a n-dimensional bilayer thin film of thickness 2δ whose layers are connected through an ε-periodically distributed contact zone. Describing the contact zone as a union of (n − 1)-dimensional balls of radius r ≪ ε (the holes of the sieve) and assuming that δ ≪ ε, we show that the asymptotic memory of the sieve (as ε → 0) is witnessed by ...

A higher-dimensional sieve method with procedures for computing sieve functions

In what case do you like reading so much? What about the type of the a higher dimensional sieve method with procedures for computing sieve functions book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge from the book and want to read just to get entertainment. Novels, story book, and other entertainin...

A construction of 3-dimensional lattice sieve for number field sieve over F_{p^n}

The security of pairing-based cryptography is based on the hardness of solving the discrete logarithm problem (DLP) over extension field GF(p) of characteristic p and degree n. Joux et al. proposed an asymptotically fastest algorithm for solving DLP over GF(p) (JLSV06-NFS) as the extension of the number field sieve over prime field GF(p) (JL03-NFS). The lattice sieve is often used for a largesc...

Sieve Methods Lecture Notes, Part I the Brun-hooley Sieve

A sieve is a technique for bounding the size of a set after the elements with “undesirable properties” (usually of a number theoretic nature) have been removed. The undesirable properties could be divisibility by a prime from a given set, other multiplicative constraints (divisibility by a perfect square for example) or inclusion in a set of residue classes. The methods usually involve some kin...

The Brun-hooley Sieve